Compensating for Failures with Flexible Servers

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compensating for Failures with Flexible Servers

We consider the problem of maximizing capacity in a queueing network with flexible servers, where the classes and servers are subject to failure. We assume that the interarrival and service times are independent and identically distributed, that routing is probabilistic, and that the failure state of the system can be described by a Markov process that is independent of the other system dynamic...

متن کامل

CONTROL OF FLEXIBLE JOINT ROBOT MANIPULATORS BY COMPENSATING FLEXIBILITY

A flexible-joint robot manipulator is a complex system because it is nonlinear, multivariable, highly coupled along with joint flexibility and uncertainty. To overcome flexibility, several methods have been proposed based on flexible model. This paper presents a novel method for controlling flexible-joint robot manipulators. A novel control law is presented by compensating flexibility to form a...

متن کامل

Flexible Servers in Tandem Lines with Setups

We study the dynamic assignment of flexible servers to stations in the presence of setup costs that are incurred when servers move between stations. We focus on tandem lines with two stations and two servers with the goal of maximizing the long-run average profit. We investigate how the optimal server assignment policy for such systems depends on the magnitude of the setup costs, as well as on ...

متن کامل

Dynamic server allocation for unstable queueing networks with flexible servers

This paper is concerned with the dynamic assignment of servers to tasks in queueing networks where demand may exceed the capacity for service. The objective is to maximize the system throughput. We use fluid limit analysis to show that several quantities of interest, namely the maximum possible throughput, the maximum throughput for a given arrival rate, the minimum arrival rate that will yield...

متن کامل

Flexible disk scheduling for multimedia presentation servers

Objects composing a multimedia presentation need to be delivered based on the temporal relationships specified by the author(s). Hence, even discrete media objects (that do not normally have any real-time characteristics) have temporal constraints on their presentations. Composition of multimedia presentations can vary widely. Based on their composition, we can consider three broad categories o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Operations Research

سال: 2007

ISSN: 0030-364X,1526-5463

DOI: 10.1287/opre.1070.0437